On the f-matching polytope and the fractional f-chromatic index

نویسنده

  • Stefan Glock
چکیده

Our motivation is the question how similar the f -colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters. In 2010, Zhang, Yu, and Liu [9] gave a new description of the f -matching polytope and derived a formula for the fractional f -chromatic index, stating that the fractional f -chromatic index equals the maximum of the fractional maximum f -degree and the fractional f -density. Unfortunately, this formula is incorrect. We present counterexamples for both the description of the f -matching polytope and the formula for the fractional f -chromatic index. Finally, we prove a short lemma concerning the generalization of Goldberg's Conjecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...

متن کامل

The locating-chromatic number for Halin graphs

Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...

متن کامل

On the Fractional Intersection Number of a Graph

An intersection representation of a graph G is a function f : V…G† ! 2 (where S is any set) with the property that uv A E…G† if and only if f …u†V f …v†0h. The size of the representation is jSj. The intersection number of G is the smallest size of an intersection representation of G. The intersection number can be expressed as an integer program, and the value of the linear relaxation of that p...

متن کامل

Random Lifts of Graphs III: Independence and Chromatic Number

For a graph G, a random n-lift of G has the vertex set V (G) n] and for each edge u; v] 2 E(G), there is a random matching between fug n] and fvg n]. We present bounds on the chromatic number and on the independence number of typical random lifts, with G xed and n ! 1. For the independence number, upper and lower bounds are obtained as solutions to certain optimization problems on the base grap...

متن کامل

Integer round-up property for the chromatic number of some h-perfect graphs

A graph is h-perfect if its stable set polytope can be completely described by nonnegativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph G and every c ∈ Z (G) + , the weighted chromatic number of (G, c) is the minimum cardinality of a multi-set F of stable sets of G such that every v ∈ V (G) belongs to at least cv members of F . W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 92  شماره 

صفحات  -

تاریخ انتشار 2015